Reducing the Gate Count of Bitslice DES
نویسنده
چکیده
This paper describes various techniques to reduce the number of logic gates needed to implement the DES S-boxes in bitslice software. Using standard logic gates, an average of 56 gates per S-box was achieved, while an average of 51 was produced when non-standard gates were utilized. This is an improvement over the previous best result, which used an average of 61 non-standard gates.
منابع مشابه
Fast Software Implementations of MISTY1 on Alpha Processors
In this paper, we show two methods for fast software implementations of block cipher algorithm MISTY1 on Digital Alpha processors. One is based on the method proposed by Biham at the fourth Fast Software Encryption Workshop. This method, which is called “bitslice,” realizes high performance by regarding the target cipher as a collection of logic gates and processing plural blocks in parallel, a...
متن کاملSerpent: A New Block Cipher Proposal
We propose a new block cipher as a candidate for the Advanced Encryption Standard. Its design is highly conservative, yet still allows a very efficient implementation. It uses the well-understood DES S-boxes in a new structure that simultaneously allows a more rapid avalanche, a more efficient bitslice implementation, and an easy analysis that enables us to demonstrate its security against all ...
متن کاملImproving the security and efficiency of block ciphers based on LS-designs
LS-designs are a family of bitslice ciphers aiming at efficient masked implementations against side-channel analysis. This paper discusses their security against invariant subspace attacks, and describes an alternative family of eXtended LS-designs (XLS-designs), that enables additional options to prevent such attacks. LSand XLS-designs provide a large family of ciphers from which efficient imp...
متن کاملReducing Quantum Cost in Reversible Toffoli Circuits
Recently, reversible circuit synthesis has been intensively studied. One of the problems that has not been solved for a long time was exact minimization of gate count (GC) in 4-bit circuits. Finally, last year a tool of practical usage for finding optimal gate count Toffoli networks for any 4variable function was developed. However, not much work has been done yet on exact minimization of quant...
متن کاملFormal Methods for Reverse Engineering Gate-Level Netlists
Components An abstract component α is a triple (I, O,S), where I and O are sets of input and output signals, respectively, and S is a formal specification defining allowed input-output behavior of the component. An instance of an abstract component α is any circuit or netlist that satisfies the specification S of α. We illustrate the notion of an abstract component using an example. Example 2. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2000 شماره
صفحات -
تاریخ انتشار 2000